Management Science (K6)

K6-Minors in Projective Planar Graphs

It is shown that every 5-connected graph embedded in the projective plane with face-width at least 3 contains the complete graph on 6 vertices as a minor.

Scientific Management of Science? Scientific Management of Science?

A framework is advanced for allocating research resources, based on the value of the information that proposed projects are expected to produce. As an organizing device, the framework uses integrated assessments, showing the relationships between the predictors of outcomes arising in important decisions (e.g., interest rates, mortality rates, crop yields, crime probabilities). Proposed projects...

K6-Minors in triangulations on surfaces

We say that a graph H is a minor of a graph G if H can be obtained from G by a sequence of contractions and deletions of edges. An H-minor is a minor of H. Let Kn denote a complete graph with n vertices. A triangulation of a surface is a fixed embedding of a simple graph on the surface such that each face is bounded by a cycle of length exactly three. It is easy to see that every triangulation ...

Testability Features of the AMD-K6 Microprocessor

K6 minors in large 6-connected graphs

Jørgensen conjectured that every 6-connected graph G with no K6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs. 8 April 2005, revised 22 May 2009. Partially supported by NSF under Grant No. DMS-0200595. Partially supported by NSF under Grants No. DMS-0200595 and. DMS-0354742.